We propose a new genetic algorithm with optimal recombination for theasymmetric instances of travelling salesman problem. The algorithm incorporatesseveral new features that contribute to its effectiveness: (i) Optimalrecombination problem is solved within crossover operator. (ii) A new mutationoperator performs a random jump within 3-opt or 4-opt neighborhood. (iii)Greedy constructive heuristic of W.Zhang and 3-opt local search heuristic areused to generate the initial population. A computational experiment on TSPLIBinstances shows that the proposed algorithm yields competitive results to otherwell-known memetic algorithms for asymmetric travelling salesman problem.
展开▼
